On the approximability of some maximum spanning tree problems
نویسندگان
چکیده
منابع مشابه
On the approximability of robust spanning tree problems
In this paper the minimum spanning tree problem with uncertain edge costs is discussed. In order to model the uncertainty a discrete scenario set is specified and a robust framework is adopted to choose a solution. The min-max, min-max regret and 2-stage min-max versions of the problem are discussed. The complexity and approximability of all these problems are explored. It is proved that the mi...
متن کاملOn the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
The aim of this paper is to give a complete picture of approximability for two tree consensus problems which are of particular interest in computational biology: Maximum Agreement SubTree (MAST) and Maximum Compatible Tree (MCT). Both problems take as input a label set and a collection of trees whose leaf sets are each bijectively labeled with the label set. Define the size of a tree as the num...
متن کاملThe Minimum Spanning Tree of Maximum Entropy
In computer vision, we have the problem of creating graphs out of unstructured point-sets, i.e. the data graph. A common approach for this problem consists of building a triangulation which might not always lead to the best solution. Small changes in the location of the points might generate graphs with unstable configurations and the topology of the graph could change significantly. After buil...
متن کاملOn the approximability of some degree-constrained subgraph problems
In this article we provide hardness results and approximation algorithms for the following three natural degree-constrained subgraph problems, which take as input an undirected graph G = (V, E). Let d ≥ 2 be a fixed integer. The Maximum d-degree-bounded Connected Subgraph (MDBCSd) problem takes as additional input a weight function ω : E → R, and asks for a subset E′ ⊆ E such that the subgraph ...
متن کاملThe maximum f-depth spanning tree problem
This paper deals with the problem of constructing directed trees of optimal weight and root r with depth at most f(|V |) (called f − depthDSTPr). We first prove that the maximization and the minimization versions are equal-approximable under the differential ratio, that measures how the value of an approximate solution is placed in the interval between the worst and the best solutions values of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00265-4